Spectral dimensions of hierarchical scale-free networks with weighted shortcuts
نویسندگان
چکیده
منابع مشابه
Spectral dimensions of hierarchical scale-free networks with weighted shortcuts.
Spectral dimensions have been widely used to understand transport properties on regular and fractal lattices. However, they have received little attention with regard to complex networks such as scale-free and small-world networks. Here, we study the spectral dimension and the return-to-origin probability of random walks on hierarchical scale-free networks, which can be either fractal or nonfra...
متن کاملSpectra of weighted scale-free networks
Much information about the structure and dynamics of a network is encoded in the eigenvalues of its transition matrix. In this paper, we present a first study on the transition matrix of a family of weight driven networks, whose degree, strength, and edge weight obey power-law distributions, as observed in diverse real networks. We analytically obtain all the eigenvalues, as well as their multi...
متن کاملNonlocal evolution of weighted scale-free networks.
We introduce the notion of globally updating evolution for a class of weighted networks, in which the weight of a link is characterized by the amount of data packet transport flowing through it. By noting that the packet transport over the network is determined nonlocally, this approach can explain the generic nonlinear scaling between the strength and the degree of a node. We demonstrate by a ...
متن کاملSpectral densities of scale-free networks.
The spectral densities of the weighted Laplacian, random walk, and weighted adjacency matrices associated with a random complex network are studied using the replica method. The link weights are parametrized by a weight exponent beta. Explicit results are obtained for scale-free networks in the limit of large mean degree after the thermodynamic limit, for arbitrary degree exponent and beta.
متن کاملScale-free properties of weighted networks with connectivity-driven topology
The rate equations are used to study the scale-free behavior of the weight distribution in evolving networks whose topology is determined only by degrees of preexisting vertices. An analysis of these equations shows that the degree distribution and thereby the weight distribution remain unchanged when the probability rate of attaching new nodes is replaced with some unnormalized rate. Such a mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2010
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.82.056110